Term Equational Rewrite Systems and Logics
نویسندگان
چکیده
We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to synthetise a complete TERL. Indeed, as an application, we derive a sound and complete equational rewrite logic based on the category of Nominal Sets.
منابع مشابه
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules
We consider a constrained equational logic where the constraints are membership conditions t 2 s where s is interpreted as a regular tree language. Our logic includes a fragment of second order equational logic (without projections) where second order variables range over regular sets of contexts. The problem with constrained equational logics is the failure of the critical pair lemma. That is ...
متن کاملRewrite Proofs and Computations ?
Rewriting is a general paradigm for expressing computations in various logics, and we focus here on rewriting techniques in equational logic. When used at the proof level, rewriting provides with a very powerful methodology for proving completeness results, a technique that is illustrated here. We also consider whether important properties of rewrite systems such as connuence and termination ca...
متن کاملTerm Equational Systems and Logics
We introduce an abstract general notion of system of equations between terms, called Term Equational System, and develop a sound logical deduction system, called Term Equational Logic, for equational reasoning. Further, we give an analysis of algebraic free constructions that together with an internal completeness result may be used to synthesise complete equational logics. Indeed, as an applic...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملConfluent Term Rewriting for Only-knowing Logics
Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are suffic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008